OFDM transmission/receiving system and block encoding method therefor

ABSTRACT

An orthogonal frequency division multiplexing (OFDM) transmission/receiving system, and a block encoding method therefor, are provided. The OFDM transmission system includes a block encoder for encoding binary data of U length into V-ary data expressed in a group of n bits according to a predetermined mapping rule, a serial-to-parallel converter for converting the V-ary data into parallel data, a V-ary modulator for V-ary modulating V-ary data received in parallel to generate an orthogonal frequency division multiplexing (OFDM) symbol having U sub-symbols, and a transmitter for post-processing the OFDM symbol so that the OFDM symbol is suitable for telecommunications and transmitting the resultant OFDM symbol. In this method, Q-ary data is block encoded and Q-ary modulated to reduce the ratio of the peak power to the average power of an OFDM signal when it is transmitted, so that the OFDM signal can be transmitted at a high data transmission rate as compared to the prior art in which binary data is block encoded.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to an orthogonal frequency division multiplexing (OFDM) transmission/receiving system and a block encoding method therefor.

2. Description of the Related Art

OFDM, which is a multiplexed carrier modulation method, stands up very well against multi-path fading and inter-symbol interference, and provides a low signal-to-noise ratio (SNR). In OFDM, data can be reliably transmitted at a high data transmission rate even in a channel where severe temporal dispersion occurs. In particular, the OFDM technique is suitable for the radio communications field, and has been applied to wireless LAN and digital audio or video broadcasting.

However, the OFDM technique has a disadvantage in that, in certain circumstances, a very high peak-to-average power ratio (hereinafter, referred to as a PAR) is obtained upon transmission of an OFDM signal. For instance, when data is transmitted using N subcarriers, a peak power, which is N times as large as an average power, can be obtained, such as in situations were N in-phase signals are summed. The peak power, which is greater than the average power, becomes a non-linear factor and provokes intermodulation between subcarriers. This deteriorates the SNR at a receiver and causing unwanted out-of-band radiation. If a power amplifier or mixer operates with a small back-off, it is not possible to maintain out-of-band power within the limits imposed by telecommunications authorities, and the SNR at the receiver is deteriorated. Therefore, the power amplifier preferably operates with a large back-off to prevent spectral regrowth of an OFDM signal due to the intermodulation between subcarriers and unwanted out-of-band radiation. This means that the amplifier operates ineffectively. Consequently, the cost of transmitters increases.

In order to solve this problem, it is preferable to reduce the PAR by performing fast Fourier transforms (FFT) or an alternative method of changing the phase of a signal or a method of using a block code. In the method of using FFT, a solution for reducing the PAR is searched by adding a block which has a value at only an arbitrary subcarrier in front of a fast Fourier transformer (FFT) and alternating FFT and inverse FFT (IFFT). However, in this method, the same work is repeated on every transmission data to find a value for reducing the PAR. Accordingly, realization of this method is complicated, and temporal delay occurs, so that this method is not suitable for telecommunications systems.

The method of changing the phase is to appropriately convert the phases of the N signals to be transmitted in order to prevent the N signals from having the same phase. This phase changing method includes complementary codes using Golay codes and Reed-Muller codes. The complementary codes use a phase shifter which is expressed as an exponential function, in order to convert the phases of the N signals into a set of phase codes. However, the phase shifter has a problem in that it is complicated to realize in hardware.

The block code method has a disadvantage in that an encoder and a decoder are large due to a codebook. Also, only a block code for binary modulation data is considered in this method, so the data transmission rate is low.

SUMMARY OF THE INVENTION

To solve the above problems, an objective of the present invention is to provide an orthogonal frequency division multiplexing (OFDM) transmission system for encoding binary data having a predetermined length into Q-ary data which is expressed in a pair of two bits, and modulating the encoded binary data, and an OFDM receiving system for demodulating and decoding a received OFDM signal, and a block encoding method for encoding the binary data into Q-ary data.

To achieve the above objective, the present invention provides an orthogonal frequency division multiplexing (OFDM) transmission system including: a block encoder for encoding binary data of U length into V-ary data expressed in a group of n bits according to a predetermined mapping rule; a serial-to-parallel converter for converting the V-ary data into parallel data; a V-ary modulator for V-ary modulating V-ary data received in parallel to generate an orthogonal frequency division multiplexing (OFDM) symbol having U sub-symbols; and a transmitter for post-processing the OFDM symbol so that the OFDM symbol is suitable for telecommunications and transmitting the resultant OFDM symbol.

To achieve the above objective, the present invention provides an orthogonal frequency division multiplexing (OFDM) receiving system including: a preprocessor for pre-processing an OFDM symbol transmitted via U carrier waves so that the OFDM symbol is suitable for demodulation; a V-ary demodulator for V-ary demodulating the preprocessed OFDM signal to generate V-ary data expressed in a group of n bits; a parallel-to-serial converter for converting the V-ary data into serial data; and a block decoder for decoding serial V-ary data into binary data of U length according to a predetermined mapping rule.

To achieve the above objective, the present invention provides a block ending method for OFDM transmission, including: generating V-ary data expressed in a group of n bits; generating an OFDM symbol by modulating and inverse-fast-Fourier-transforming the V-ary data; determining whether the OFDM symbol satisfies a predetermined condition, and if the OFDM symbol satisfies the predetermined condition, classifying the OFDM symbol as a candidate codeword; extracting as many codewords as the number of receivable binary data from candidate codewords, in sequence of codewords having a small bit change; and forming a codebook by matching the extracted codewords to each receivable binary data.

BRIEF DESCRIPTION OF THE DRAWINGS

The above objectives and advantages of the present invention will become more apparent by describing in detail a preferred embodiment thereof with reference to the attached drawings in which:

FIGS. 1A and 1B are block diagrams of an orthogonal frequency division multiplexing (OFDM) transmission system according to the present invention and an OFDM receiving system according to the present invention, respectively;

FIG. 2A is a flowchart illustrating a method of designing the block encoder and the block decoder shown in FIGS. 1A and 1B;

FIG. 2B is a block diagram of an apparatus for designing a block encoder;

FIG. 3 illustrates an example of a codebook formed by performing the steps shown in FIG. 2A; and

FIG. 4 illustrates an example of a segmented codebook used in the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENT

Referring to FIG. 1A, an orthogonal frequency division multiplexing (OFDM) transmission system according to the present invention includes a block encoder 100, a serial-to-parallel converter (SPC) 101, a Q-ary modulator 102, an inverse fast Fourier transformer (IFFT) 103, a cyclic prefix adder 104, a digital-to-analog converter (DAC) 105, and a low pass filter (LPF) 106.

The block encoder 100 block-encodes binary data having a predetermined length at a predetermined code rate. In the case of a transmission system having 8 subcarriers, 8-bit binary data A₀, A₁, . . . , A₇ are block encoded at a code rate of ½ and converted into 16-bit binary data C₀, C₁, . . . , C₁₅. This conversion follows a predetermined mapping rule. The SPC 101 converts data converted by the block encoder 100 into parallel data.

The Q-ary modulator 102 modulates 16-bit binary data C₀, C₁, . . . , C₁₅ according to a Q-ary data value expressed in a pair of two bits, to form 8 sub-symbols. A quadrature amplitude modulator or a quadrature phase shift keying apparatus is appropriate for the Q-ary modulator 102. In the present invention, the Q-ary modulator is taken as an example for simple explanation, but it can be extended to a V-ary modulator according to the results of encoding by the block encoder 100.

The IFFT 103 performs 8-IFFT on data modulated by the Q-ary modulator 102 to form an OFDM symbol. The cyclic prefix adder 104 adds a cyclic prefix to the OFDM symbol. The length of the added cyclic prefix is about 10% of the length of an OFDM symbol. The DAC 105 converts the OFDM symbol to which the cyclic prefix is added into an analog signal, and LPF 106 low-pass filters the analog signal.

FIG. 1B is a block diagram of an OFDM receiving system for receiving a signal transferred from the transmission system of FIG. 1A. The receiving system of FIG. 1B includes an LPF 110, an analog-to-digital converter (ADC) 111, a cyclic prefix remover 112, an FFT 113, a Q-ary demodulator 114, a parallel-to-serial converter (PSC) 115, and a block decoder 116.

The LPF 110 in the receiving system filters the transmitted OFDM signal at the same frequency band as the LPF 106 of the transmission system. The ADC 111 converts a filtered signal into a digital signal, and the cyclic prefix remover 112 removes the cyclic prefix added in the transmission system. The FFT 113, the Q-ary demodulator 114, the PSC 115 and the block decoder 116 perform inverse processes of the processes performed by the counterparts of the transmission system, thereby restoring an OFDM signal.

The above description refers to a system for transmitting and receiving using 8 subcarriers. In the case that transmission is performed using 16 subcarriers, the transmission system further includes an interleaver (not shown) between a block encoder 100 and an SPC 101. If 16-bit binary data A₀, . . . , A₇, A₈, . . . , A₁₅ are sequentially received, the block encoder 100 block-encodes the 16-bit binary data A₀, . . . , A₇, A₈, . . . , A₁₅ at a code rate of ½ to output C₀C₁ . . . , C₁₄C₁₅ and C₁₆C₁₇, . . . , C₃₀C₃₁. The interleaver interleaves C₀C₁ . . . , C₁₄C₁₅C₁₆C₁₇, . . . , C₃₀C₃₁ into C₀C₁C₁₆C₁₇C₂C₃C₁₈C₁₉ . . . C₁₄C₁₅C₃₀C₃₁. At this time, the output of the Q-ary modulator 102 is an OFDM symbol having 16 sub-symbols.

In the case that transmission is performed using 16 subcarriers, the receiving system further includes a deinterleaver (not shown) between the PSC 115 and the block encoder 116. The deinterleaver deinterleaves C₀C₁C₁₆C₁₇C₂C₃C₁₈C₁₉ . . . C₁₄C₁₅C₃₀C₃₁ into C₀C₁ . . . , C₁₄C₁₅C₁₆C₁₇, . . . , C₃₀C₃₁.

FIG. 2A is a flowchart illustrating a method of designing the block encoder and the block decoder shown in FIGS. 1A and 1B. The method of designing the block encoder and the block decoder shown in FIGS. 1A and 1B, includes a V-ary data production method 200, an OFDM symbol production step 202, a determination step (204 and 206), a mapping rule generating step (208 through 214), and a hardware designing step 216.

FIG. 2B is a block diagram of an apparatus for performing the steps shown in FIG. 2A. The apparatus of FIG. 2B includes a V-ary data generator 240, an OFDM symbol generator 242, a determiner 244, a codeword extractor 246, a codebook storage unit 248, a mapping rule generator 250 and a hardware 252.

The method of designing a block encoder and a block decoder, according to the present invention, will now be described in detail referring to FIGS. 2A and 2B.

When the required number of sub-symbols, U, and a modulation method, V-ary, of data to be transmitted in units of sub-symbols, are determined, the V-ary data generator 240 generates V-ary data having a length of U, in step 200. The OFDM symbol generator 242 V-ary modulates the V-ary data and preforms IFFT on the V-ary data, thereby generating an OFDM symbol, in step 201. The determiner 244 determines whether the OFDM symbol satisfies a predetermined condition, for example, whether the PAR of the OFDM symbol is smaller than or equal to a desired value PAR_(de), in step 204. If the OFDM symbol satisfies the predetermined condition, the determiner 144 classifies an OFDM symbol into a candidate codeword, in step 206.

If Q-ary data having 8 sub-symbols are modulated and transmitted, 640 data satisfying the condition of PAR_(u=8)≦1.03 dB, among a total of 4⁸ (=45536) Q-ary data, are classified as candidate codewords, for example. If Q-ary data having 16 sub-symbols is transmitted, it is preferable that the condition of determining whether Q-ary data can be classified as a candidate codeword is PAR_(de)≅6 dB, for example.

PAR can be calculated by Equation 1: $\begin{matrix} {{PAR} = \frac{{\max \left( {{X(t)}} \right)}^{2}}{\frac{1}{T}{\int_{0}^{T}{\left(  \right.{X(t)}\left.  \right)^{2}{t}}}}} & (1) \end{matrix}$

wherein X(t) denotes an OFDM symbol, and T denotes the duration of an OFDM symbol.

The codeword extractor 246 extracts as many codewords as the total number of received binary data, which can reduce the size of an encoder or a decoder. In other words, this extractor 246 can reduce the number of gates constituting the encoder or the decoder because of a small bit change between data, from classified candidate codewords, and sets the extracted codewords as final codewords, in step 208. If 8-long binary data, that is, 8-bit binary data, is received, 2⁸ (=256) codewords are extracted. The codebook storage unit 248 stores a codebook for mapping these codewords into binary data, in step 210. FIG. 3, which illustrates an example of a codebook formed by performing these steps, shows the relationship between the input and output of an encoder or a decoder. The numbers shown in the codebook are expressed in hexadecimal form, MS denotes four most significant bits A₀A₁A₂A₃ of an encoder, and LS denotes four least significant bits A₄A₅A₆A₇ of the encoder. The rest of the numbers are expressed in hexadecimal form of 16-bit output data C₀C₁ . . . C₁₄C₁₅ which corresponds to each of the inputs of an encoder comprised of MS and LS.

The codebook storage unit 248 can be considered as a block encoder. That is, received binary data acts as an address, and a codeword stored at a position indicated by the address can be read and output. In order to perform this operation faster, a predetermined mapping rule is extracted from the codebook, and a block encoder can be implemented as hardware so that the extracted mapping rule is satisfied. To do this, the mapping rule generator 250 segments the codebook into predetermined areas, in step 212. FIG. 4 illustrates an example of a segmented codebook used in the present invention. As shown in FIG. 4, the codebook is segmented into areas G, H, J, K, L, M, N, P, Q and R. For example, 64 codewords satisfy the area G. The segmented area G is simplified according to the well-known Karnaugh map, thereby establishing the following boolean logic equation 2:

G={overscore (A₀)} {overscore (A₁)} {overscore (A₄)} A ₅ +{overscore (A₀)} A ₁ {overscore (A₄)} {overscore (A₅)} +A ₀ {overscore (A₁)} A ₄ A ₅ +A ₀ A ₁ A ₄ {overscore (A₅)}  (2)

Similarly, the areas H, J, K, L, M, N, P, Q and R can be expressed by the following boolean logic Equation 3:

 H={overscore (A₀)} {overscore (A₁)} A ₄ {overscore (A₅)} +{overscore (A₀)} A ₁ A ₄ A ₅ +A ₀ {overscore (A₁)} {overscore (A₄)} {overscore (A₅)} +A ₀ A ₁ {overscore (A₄)} A ₅

K={overscore (A₀)} {overscore (A₁)} A ₂ {overscore (A₄)} {overscore (A₅)} +{overscore (A₀)} A ₁ A ₂ {overscore (A₄)} A ₅

J={overscore (A₀)} {overscore (A₁)} {overscore (A₂)} {overscore (A₄)} {overscore (A₅)} +{overscore (A₀)} A ₁ {overscore (A₂)} {overscore (A₄)} A ₅

L=A ₀ {overscore (A₁)} {overscore (A₂)} A ₄ {overscore (A₅)} +A ₀ A ₁ {overscore (A₂)} A ₄ A ₅

M=A ₀ {overscore (A₁)} A ₂ A ₄ {overscore (A₅)} +A ₀ A ₁ A ₂ A ₄ A ₅

N={overscore (A₀)} {overscore (A₁)} {overscore (A₂)} A ₄ A ₅ +{overscore (A₀)} A ₁ {overscore (A₂)} A ₄ {overscore (A₅)}

P={overscore (A₀)} {overscore (A₁)} A ₂ A ₄ A ₅ +{overscore (A₀)} A ₁ A ₂ A ₄ {overscore (A₅)}

Q=A ₀ {overscore (A₁)} {overscore (A₂)} {overscore (A₄)} A ₅ +A ₀ A ₁ {overscore (A₂)} {overscore (A₄)} {overscore (A₅)}

R=A ₀ {overscore (A₁)} A ₂ {overscore (A₄)} A ₅ +A ₀ A ₁ A ₂ {overscore (A₄)} {overscore (A₅)}  (3)

In step 214, a mapping rule of encoding A₀, . . . , A₇ into C₀, . . . , C₁₅ on the basis of Equations 2 and 3 can be expressed by the following boolean encoding logic Equation 4: $\begin{matrix} \begin{matrix} {C_{0} = {{A_{0}G} + {A_{0}H} + {A_{0}J} + {A_{0}K} + {A_{0}L} + {A_{0}M} + {A_{0}N} + {A_{0}P} +}} \\ {{{A_{0}Q} + {A_{0}R}}} \end{matrix} & (4) \\ \begin{matrix} {C_{1} = {{A_{1}G} + {A_{1}H} + {A_{1}J} + {A_{1}K} + {A_{1}L} + {A_{1}M} + {A_{1}N} + {A_{1}P} +}} \\ {{{A_{1}Q} + {A_{1}R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{2} = {{A_{2}G} + {A_{2}H} + {A_{2}J} + {A_{2}K} + {A_{2}L} + {A_{2}M} + {A_{2}N} + {A_{2}P} +}} \\ {{{A_{2}Q} + {A_{2}R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{3} = {{A_{3}G} + {A_{3}H} + {A_{3}J} + {A_{3}K} + {A_{3}L} + {A_{3}M} + {A_{3}N} + {A_{3}P} +}} \\ {{{A_{3}Q} + {A_{3}R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{4} = {{A_{4}G} + {A_{4}H} + {A_{4}J} + {A_{4}K} + {A_{4}L} + {A_{4}M} + {A_{4}N} + {A_{4}P} +}} \\ {{{A_{4}Q} + {A_{4}R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{5} = {{A_{5}G} + {A_{5}H} + {A_{5}J} + {A_{5}K} + {A_{5}L} + {A_{5}M} + {A_{5}N} + {A_{5}P} +}} \\ {{{A_{5}Q} + {A_{5}R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{6} = {{A_{6}G} + {A_{6}H} + {{\overset{\_}{A}}_{4}J} + {A_{4}K} + {A_{0}L} + {{\overset{\_}{A}}_{0}M} + {A_{0}N} + {A_{4}P} +}} \\ {{{A_{4}Q} + {A_{0}R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{7} = {{A_{7}G} + {A_{7}H} + {{\overset{\_}{A}}_{3}J} + {{\overset{\_}{A}}_{3}K} + {{\overset{\_}{A}}_{3}L} + {{\overset{\_}{A}}_{3}M} + {A_{3}N} + {A_{3}P} +}} \\ {{{A_{3}Q} + {A_{3}R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{8} = {{\left\lbrack {{\left( {{\overset{\_}{A_{0}}\quad \overset{\_}{A_{2}}} + {A_{0}A_{2}}} \right)\overset{\_}{A_{6}}} + {\left( {{\overset{\_}{A_{0}}A_{2}} + {A_{0}\overset{\_}{A_{2}}}} \right)A_{6}}} \right\rbrack G} +}} \\ {{{\left\lbrack {{\left( {{A_{0}A_{3}} + {\overset{\_}{A_{0}}\quad \overset{\_}{A_{3}}}} \right)A_{7}} + {\left( {A_{0} + A_{3}} \right)\left( {\overset{\_}{A_{0}} + \overset{\_}{A_{3}}} \right)\overset{\_}{A_{7}}}} \right\rbrack H} +}} \\ {{{A_{6}J} + {A_{6}K} + {A_{6}L} + {A_{6}M} + {A_{6}N} + {A_{6}P} + {A_{6}Q} + {A_{6}R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{9} = {{\left\lbrack {{\left( {{\overset{\_}{A_{1}}\quad \overset{\_}{A_{2}}} + {A_{1}A_{2}}} \right)A_{6}} + {\left( {\overset{\_}{A_{1}}\quad + \overset{\_}{A_{2}}} \right)\left( {A_{1} + A_{2}} \right)\overset{\_}{A_{6}}}} \right\rbrack G} +}} \\ {{{\left\lbrack {{\left( {{A_{1}A_{3}} + {\overset{\_}{A_{1}}\quad \overset{\_}{A_{3}}}} \right)\overset{\_}{A_{7}}} + {\left( {A_{1} + A_{3}} \right)\left( {\overset{\_}{A_{1}} + \overset{\_}{A_{3}}} \right)A_{7}}} \right\rbrack H} +}} \\ {{{\left( {{\overset{\_}{A_{1}}\quad \overset{\_}{A_{6}}} + {A_{1}A_{6}}} \right)J} + {\left( {{\overset{\_}{A_{1}}\quad \overset{\_}{A_{6}}} + {A_{1}A_{6}}} \right)K} +}} \\ {{{\left( {{\overset{\_}{A_{1}}A_{6}} + {A_{1}\overset{\_}{A_{6}}}} \right)L} + {\left( {{\overset{\_}{A_{1}}A_{6}} + {A_{1}\overset{\_}{A_{6}}}} \right)M} +}} \\ {{{\left( {{\overset{\_}{A_{5}}A_{6}} + {A_{5}\overset{\_}{A_{6}}}} \right)N} + {\left( {{\overset{\_}{A_{5}}A_{6}} + {A_{5}\overset{\_}{A_{6}}}} \right)P} +}} \\ {{{\left( {{A_{5}A_{6}} + {\overset{\_}{A_{5}}\quad \overset{\_}{A_{6}}}} \right)Q} + {\left( {{A_{5}A_{6}} + {\overset{\_}{A_{5}}\quad \overset{\_}{A_{6}}}} \right)R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{10} = {{A_{2}G} + {\overset{\_}{A_{2}}H} + {\overset{\_}{A_{6}}A_{7}J} + {\left( {A_{6} + A_{7}} \right)K} + {A_{6}A_{7}L} +}} \\ {{{\left( {\overset{\_}{A_{6}} + A_{7}} \right)M} + {A_{6}A_{7}N} + {\left( {\overset{\_}{A_{6}} + A} \right)P} + {\overset{\_}{A_{6}}A_{7}Q} +}} \\ {{\left( {A_{6} + A_{7}} \right)R}} \end{matrix} & \quad \\ \begin{matrix} {C_{11} = {{\overset{\_}{A_{3}}G} + {A_{3}H} + {\left\lbrack {{\overset{\_}{A_{3}}A_{6}A_{7}} + {A_{3}\left( {\overset{\_}{A_{6}} + A_{7}} \right)}} \right\rbrack J} +}} \\ {{{\left\lbrack {{\overset{\_}{A_{3}}A_{6}\overset{\_}{A_{7}}} + {A_{3}\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)}} \right\rbrack K} + \left\lbrack {{\overset{\_}{A_{3}}\quad \overset{\_}{A_{6}}A_{7}} +} \right.}} \\ {{\left. {A_{3}\left( {A_{6} + A_{7}} \right)} \right\rbrack L} + {\left\lbrack {{\overset{\_}{A_{3}}\quad \overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}} + {A_{3}\left( {\overset{\_}{A_{7}} + A_{6}} \right)}} \right\rbrack M} +} \\ {{{\left\lbrack {{\overset{\_}{A_{3}}\quad \overset{\_}{A_{6}}A_{7}} + {A_{3}\left( {A_{6} + A_{7}} \right)}} \right\rbrack K} + \left\lbrack {{\overset{\_}{A_{3}}\quad \overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}} +} \right.}} \\ {{\left. {A_{3}\left( {\overset{\_}{A_{7}} + A_{6}} \right)} \right\rbrack L} + {\left\lbrack {{\overset{\_}{A_{3}}A_{6}A_{7}} + {A_{3}\left( {\overset{\_}{A_{6}} + A_{7}} \right)}} \right\rbrack Q} +} \\ {{\left\lbrack {{\overset{\_}{A_{3}}A_{6}\overset{\_}{A_{7}}} + {A_{3}\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)}} \right\rbrack R}} \end{matrix} & \quad \\ \begin{matrix} {C_{12} = {{\left\lbrack {{\left( {{\overset{\_}{A_{0}}\quad \overset{\_}{A_{2}}} + {A_{0}A_{2}}} \right)\overset{\_}{A_{6}}} + {\left( {{\overset{\_}{A_{0}}A_{2}} + {A_{0}\overset{\_}{A_{2}}}} \right)A_{6}}} \right\rbrack G} +}} \\ {{{\left\lbrack {{\left( {{A_{0}A_{3}} + {\overset{\_}{A_{0}}\quad \overset{\_}{A_{3}}}} \right)\overset{\_}{A_{7}}} + {\left( {A_{0} + A_{3}} \right)\left( {\overset{\_}{A_{0}} + \overset{\_}{A_{3}}} \right)A_{7}}} \right\rbrack H} +}} \\ {{{\left( {{\overset{\_}{A_{3}}A_{6}\overset{\_}{A_{7}}} + {A_{3}A_{6}A_{7}}} \right)J} + {\left( {{\overset{\_}{A_{3}}A_{6}A_{7}} + {A_{3}A_{6}\overset{\_}{A_{7}}}} \right)K} +}} \\ {{\left. \left\lbrack {\left( {A_{6} + A_{7}} \right){\overset{\_}{A_{3}}\left( {A_{6} + \overset{\_}{A_{7}}} \right)}A_{3}} \right) \right\rbrack L} + \left\lbrack {{\left( {A_{6} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} +} \right.} \\ {{\left. {\left( {A_{6} + A_{7}} \right)A_{3}} \right\rbrack M} + {\left( {\overset{\_}{A_{6}} + A_{7}} \right)N} + {\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)P} +} \\ {{{\overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}Q} + {\overset{\_}{A_{6}}A_{7}R}}} \end{matrix} & \quad \\ \begin{matrix} {C_{13} = {{\left\lbrack {{\left( {{A_{1}A_{2}} + {\overset{\_}{A_{1}}\quad \overset{\_}{A_{2}}}} \right)\overset{\_}{A_{6}}} + {\left( {\overset{\_}{A_{1}} + \overset{\_}{A_{2}}} \right)\left( {A_{1} + A_{2}} \right)A_{6}}} \right\rbrack G} +}} \\ {{{\left\lbrack {{\left( {{\overset{\_}{A_{1}}\quad \overset{\_}{A_{3}}} + {A_{1}A_{3}}} \right)\overset{\_}{A_{7}}} + {\left( {A_{1} + A_{3}} \right)\left( {\overset{\_}{A_{1}} + \overset{\_}{A_{3}}} \right)A_{7}}} \right\rbrack H} +}} \\ {{{\left\lbrack {{\overset{\_}{A_{1}}\quad \overset{\_}{A_{5}}\quad \overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}} + {A_{1}{A_{5}\left( {A_{6} + A_{7}} \right)}}} \right\rbrack J} + \left\lbrack {{\overset{\_}{A_{1}}\quad \overset{\_}{A_{5}}\quad \overset{\_}{A_{6}}A_{7}} +} \right.}} \\ {{\left. {A_{1}{A_{5}\left( {A_{6} + \overset{\_}{A_{7}}} \right)}} \right\rbrack K} + {\left\lbrack {{\overset{\_}{A_{1}}\quad \overset{\_}{A_{5}}A_{6}\overset{\_}{A_{7}}} + {A_{1}{A_{5}\left( {\overset{\_}{A_{6}} + A_{7}} \right)}}} \right\rbrack L} +} \\ {{{\left\lbrack {{\overset{\_}{A_{1}}\quad \overset{\_}{A_{5}}A_{6}A_{7}} + {A_{1}{A_{5}\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)}}} \right\rbrack M} + \left\lbrack {{\overset{\_}{A_{3}}{A_{5}\left( {A_{6} + A_{7}} \right)}} +} \right.}} \\ {{\left. {{A_{3}{A_{5}\left( {A_{6} + \overset{\_}{A_{7}}} \right)}} + {\overset{\_}{A_{1}}\quad \overset{\_}{A_{5}}\quad \overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}} + {A_{3}\overset{\_}{A_{5}}\quad \overset{\_}{A_{6}}A_{7}}} \right\rbrack N} +} \\ {\left\lbrack {{\overset{\_}{A_{1}}\quad {\overset{\_}{A_{3}}\left( {A_{6} + \overset{\_}{A_{7}}} \right)}} + {\overset{\_}{A_{1}}{A_{3}\left( {A_{6} + A_{7}} \right)}} + {A_{1}\overset{\_}{A_{3}}\quad \overset{\_}{A_{6}}A_{7}} +} \right.} \\ {{\left. {A_{1}A_{3}\overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}} \right\rbrack P} + \left\lbrack {{\overset{\_}{A_{3}}{A_{5}\left( {\overset{\_}{A_{6}} + A_{7}} \right)}} + {A_{3}{A_{5}\left( {\overset{\_}{A_{6}} + A_{7}} \right)}} +} \right.} \\ {{\left. {{\overset{\_}{A_{3}}\quad \overset{\_}{A_{5}}\quad A_{6}\quad \overset{\_}{A_{7}}} + {A_{3}\overset{\_}{A_{5}}A_{6}A_{7}}} \right\rbrack Q} + \left\lbrack {{\overset{\_}{A_{3}}{A_{5}\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)}} +} \right.} \\ {\left. {{A_{3}{A_{5}\left( {\overset{\_}{A_{6}} + A_{7}} \right)}} + {\overset{\_}{A_{3}}\quad \overset{\_}{A_{5}}A_{6}A_{7}} + {A_{3}\overset{\_}{A_{5}}A_{6}A_{7}}} \right\rbrack R} \end{matrix} & \quad \\ \begin{matrix} {C_{14} = {{A_{6}G} + {A_{6}H} + {\left\lbrack {{\left( {{A_{6}A_{7}} + {\overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}}} \right)\overset{\_}{A_{3}}} + {A_{3}\overset{\_}{A_{7}}}} \right\rbrack J} +}} \\ {{{\left\lbrack {{\left( {{A_{6}A_{7}} + {\overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}}} \right)\overset{\_}{A_{3}}} + {A_{3}A_{7}}} \right\rbrack K} + \left\lbrack {\left( {A_{6} + A_{7}} \right) +} \right.}} \\ {{\left. {{\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} + {A_{3}\overset{\_}{A_{7}}}} \right\rbrack L} +} \\ {{{\left\lbrack {{\left( {A_{6} + A_{7}} \right)\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} + {A_{3}\overset{\_}{A_{7}}}} \right\rbrack M} +}} \\ {{{\left\lbrack {{\left( {{A_{6}A_{7}} + {\overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}}} \right)\overset{\_}{A_{3}}} + {A_{3}A_{7}}} \right\rbrack N} + \left\lbrack {{\left( {{A_{6}A_{7}} + {\overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}}} \right)\overset{\_}{A_{3}}} +} \right.}} \\ {{\left. {A_{3}A_{7}} \right\rbrack P} + {\left\lbrack {\left( {A_{6} + A_{7}} \right) + {\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} + {A_{3}A_{7}}} \right\rbrack Q} +} \\ {{\left\lbrack {{\left( {A_{6} + A_{7}} \right)\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} + {A_{3}A_{7}}} \right\rbrack R}} \end{matrix} & \quad \\ \begin{matrix} {C_{15} = {{AG} + {AH} + {\left\lbrack {{\left( {A_{6} + A_{7}} \right)\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} + {A_{3}\overset{\_}{A_{7}}}} \right\rbrack J} +}} \\ {{{\left\lbrack {{\left( {A_{6} + A_{7}} \right)\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} + {A_{3}A_{7}}} \right\rbrack K} +}} \\ {{{\left\lbrack {{\left( {{A_{6}A_{7}} + {\overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}}} \right)\overset{\_}{A_{3}}} + {A_{3}\overset{\_}{A_{7}}}} \right\rbrack L} +}} \\ {{{\left\lbrack {{\left( {A_{6} + A_{7}} \right)\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} + {A_{3}A_{7}}} \right\rbrack M} +}} \\ {{{\left\lbrack {{\left( {A_{6} + A_{7}} \right)\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} + {A_{3}A_{7}}} \right\rbrack N} +}} \\ {{{\left\lbrack {{\left( {{A_{6}A_{7}} + {\overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}}} \right)\overset{\_}{A_{3}}} + {A_{3}\overset{\_}{A_{7}}}} \right\rbrack P} +}} \\ {{{\left\lbrack {{\left( {{A_{6}A_{7}} + {\overset{\_}{A_{6}}\quad \overset{\_}{A_{7}}}} \right)\overset{\_}{A_{3}}} + {A_{3}A_{7}}} \right\rbrack Q} +}} \\ {{\left\lbrack {{\left( {A_{6} + A_{7}} \right)\left( {\overset{\_}{A_{6}} + \overset{\_}{A_{7}}} \right)\overset{\_}{A_{3}}} + {A_{3}\overset{\_}{A_{7}}}} \right\rbrack R}} \end{matrix} & \quad \end{matrix}$

The hardware 252 as a block encoder is constituted by a plurality of OR gates, a plurality of AND gates, and a plurality of NOT gates so that the above logic equation is satisfied, and outputs a codeword corresponding to received binary data, in step 216.

Next, in order to establish the hardware 252 for a block decoder from the above equations, the values G, . . . ,R with respect to C₀, . . . , C₁₅ can be obtained as in the following boolean logic Equation 5:

G=(C ₉ +C ₁₃)(C ₈ +{overscore (C₁₂)})

H=(C ₈ +C ₁₂)(C ₉ +{overscore (C₁₃)})

J={overscore (C₀)} {overscore (C₂)} {overscore (C₄)} C ₆

K={overscore (C₀)} C ₂ {overscore (C₄)} {overscore (C₆)}

L=C ₀ {overscore (C₂)} C ₄ C ₆

M=C ₀ C ₂ C ₄ {overscore (C₆)}

N={overscore (C₀)} {overscore (C₂)} C ₄ {overscore (C₆)}

P={overscore (C₀)} C ₂ C ₄ C ₆

Q=C ₀ {overscore (C₂)} {overscore (C₄)} {overscore (C₆)}

R=C ₀ C ₂ {overscore (C₄)} C ₆  (5)

A mapping rule of decoding C₀, . . . , C₁₅ into A₀, . . . , A₇ on the basis of Equation 5 can be expressed by the following boolean decoding logic Equation 6: $\begin{matrix} \begin{matrix} {A_{0} = {{C_{0}G} + {C_{0}H} + {C_{0}J} + {C_{0}K} + {C_{0}L} + {C_{0}M} + {C_{0}N} +}} \\ {{{C_{0}P} + {C_{0}Q} + {C_{0}R}}} \end{matrix} & (6) \\ \begin{matrix} {A_{1} = {{C_{1}G} + {C_{1}H} + {C_{1}J} + {C_{1}K} + {C_{1}L} + {C_{1}M} + {C_{1}N} +}} \\ {{{C_{1}P} + {C_{1}Q} + {C_{1}R}}} \end{matrix} & \quad \\ \begin{matrix} {A_{2} = {{C_{2}G} + {C_{2}H} + {C_{2}J} + {C_{2}K} + {C_{2}L} + {C_{2}M} + {C_{2}N} +}} \\ {{{C_{2}P} + {C_{2}Q} + {C_{2}R}}} \end{matrix} & \quad \\ \begin{matrix} {A_{3} = {{C_{3}G} + {C_{3}H} + {C_{3}J} + {C_{3}K} + {C_{3}L} + {C_{3}M} + {C_{3}N} +}} \\ {{{C_{3}P} + {C_{3}Q} + {C_{3}R}}} \end{matrix} & \quad \\ \begin{matrix} {A_{4} = {{C_{4}G} + {C_{4}H} + {C_{4}J} + {C_{4}K} + {C_{4}L} + {C_{4}M} + {C_{4}N} +}} \\ {{{C_{4}P} + {C_{4}Q} + {C_{4}R}}} \end{matrix} & \quad \\ \begin{matrix} {A_{5} = {{C_{5}G} + {C_{5}H} + {C_{5}J} + {C_{5}K} + {C_{5}L} + {C_{5}M} + {C_{5}N} +}} \\ {{{C_{5}P} + {C_{5}Q} + {C_{5}R}}} \end{matrix} & \quad \\ \begin{matrix} {A_{6} = {{C_{6}G} + {C_{6}H} + {C_{8}J} + {C_{8}K} + {C_{8}L} + {C_{8}M} + {C_{8}N} +}} \\ {{{C_{8}P} + {C_{8}Q} + {C_{8}R}}} \end{matrix} & \quad \\ \begin{matrix} {A_{7} = {{C_{7}G} + {C_{7}H} + {\left\lbrack {{\left( {C_{10} + C_{11}} \right)\overset{\_}{C_{3}}} + {C_{3}\overset{\_}{C_{15}}}} \right\rbrack J} +}} \\ {{{\left\lbrack {{C_{3}C_{15}} + {\overset{\_}{C_{3}}C_{10}\overset{\_}{C_{11}}}} \right\rbrack K} + \left\lbrack {{\left( {C_{10} + C_{11}} \right)\overset{\_}{C_{3}}} +} \right.}} \\ {{\left. {C_{3}\overset{\_}{C_{15}}} \right\rbrack L} + {\left\lbrack {{C_{3}C_{15}} + {\overset{\_}{C_{3}}C_{10}\overset{\_}{C_{11}}}} \right\rbrack M} + \left\lbrack {{\left( {C_{10} + C_{11}} \right)\overset{\_}{C_{3}}} +} \right.} \\ {{\left. {C_{3}C_{15}} \right\rbrack N} + {\left\lbrack {{C_{3}C_{14}} + {\overset{\_}{C_{3}}C_{10}\overset{\_}{C_{11}}}} \right\rbrack P} + \left\lbrack {{\left( {C_{10} + C_{11}} \right)\overset{\_}{C_{3}}} +} \right.} \\ {{{\left\lbrack {C_{3}C_{15}} \right\rbrack Q} + {\left\lbrack {{C_{3}C_{14}} + {\overset{\_}{C_{3}}C_{10}\overset{\_}{C_{11}}}} \right\rbrack R}}} \end{matrix} & \quad \end{matrix}$

The block decoder is constituted of a plurality of OR gates, a plurality of AND gates, and a plurality of NOT gates according to the mapping rule for block decoding, in step 216.

In a rule of mapping between 8 data bits A₀, . . . , A₇ and 16 codeword bits C₀, . . . ,C₁₅ on the basis of the codebook shown in FIG. 3, there may be several different rules for reducing the number of logic equations required to reduce the PAR and organize an encoder and a decoder having a code rate of ½. That is, there can be a method of formulating input/output mapping logic equations which are different from those of the present invention. Also, there can be a method of optimally realizing a logic gate circuit on the basis of a logic equation that is given in the present invention.

According to the present invention, Q-ary data is block encoded and Q-ary modulated to reduce the ratio of the peak power to the average power of an OFDM signal when it is transmitted, so that the OFDM signal can be transmitted at a high data transmission rate as compared to the prior art in which binary data is block encoded.

A desired output value can be more easily found using a codebook upon encoding and decoding, and an encoder and a decoder can be constituted of only AND gates, OR gates and NOT gates by input output relational expressions according to the codebook. Therefore, hardware configuration can be simpler and smaller, and high-speed data transmission is possible by virtue of a reduction in the response delay of a system.

The present invention has been explained by way of exemplary embodiments to which it is not limited. Variations and modifications will occur to those skilled in the art which do not depart from the scope of the invention. 

What is claimed is:
 1. An orthogonal frequency division multiplexing (OFDM) transmission system comprising: a block encoder for encoding binary data of U length into V-ary data expressed in a group of n bits according to a predetermined mapping rule, wherein the block encoder is a codebook storage unit for storing V-ary data, which is expressed in a group of n bits, to be output corresponding to receivable binary data, and outputting V-ary data which is addressed by received binary data, wherein in front of the code book storage unit, the block encoder further comprises a V-ary data generator for generating V-ary data expressed in a group of n bits; an OFDM symbol generator for generating an OFDM symbol by V-ary modulating and inverse-fast-Fourier-transforming (IFFT) the V-ary data; a determiner for determining whether the OFDM symbol satisfies a predetermined condition, and if the OFDM symbol satisfies the predetermined condition, classifying the OFDM symbol as a candidate codeword; and a codeword extractor for extracting 2^(U) codewords having a small bit change from candidate codewords, wherein the extracted codewords are stored as the V-ary data at corresponding locations in the codebook storage unit where the binary data acts as an address; a serial-to-parallel converter for converting the V-ary data into parallel data; a V-ary modulator for V-ary modulating V-ary data received in parallel to generate an orthogonal frequency division multiplexing (OFDM) symbol having U sub-symbols; and a transmitter for transmitting the OFDM symbol.
 2. The OFDM transmission system of claim 1, wherein the determiner determines whether a ratio of the peak power to the average power of the OFDM symbol is smaller than or equal to a predetermined value.
 3. The OFDM transmission system of claim 1, wherein a codebook for storing V-ary data to be output corresponding to receivable binary data is segmented into predetermined areas, and the segment areas are expressed in a first logic equation established by each bit of the binary data according to a Karnaugh map, and each bit of the V-ary data is expressed by a second logic equation using the first logic equation and the bits of the binary data, the block encoder includes a plurality of AND gates, a plurality of OR gates and a plurality of NOT gates to satisfy the second logic equation.
 4. A block encoding method for OFDM transmission comprising: generating V-ary data expressed in a group of n bits; generating an OFDM symbol by modulating and inverse-fast-Fourier-transforming the V-ary data; determining whether the OFDM symbol satisfies a predetermined condition, and if the OFDM symbol satisfies the predetermined condition, classifying the OFDM symbol as a candidate codeword; extracting as many codewords as a number of receivable binary data from candidate codewords, in sequence of codewords having a small bit change; and forming a codebook by matching the extracted codewords to each receivable binary data.
 5. The block encoding method for OFDM transmission of claim 4, wherein the condition for classifying the OFDM symbol into the candidate codeword is a determination as to whether a ratio of the peak power to the average power of the OFDM symbol is smaller than or equal to a predetermined value.
 6. The block encoding method for OFDM transmission of claim 4, further comprising: segmenting the codebook into predetermined areas; expressing the segmented areas in first logic equations established by each bit of the binary data; expressing each bit of the codeword in second logic equations established by the segmented areas and the bits of the binary data; and organizing a block encoder which satisfies the first and second logic equations, with a plurality of AND gates, a plurality of OR gates and a plurality of NOT gates, such that the codeword is output when the binary data is received.
 7. A block encoding apparatus for OFDM transmission comprising: V-ary data generator for generating V-ary data expressed in a group of n bits; OFDM symbol generator for generating an OFDM symbol by modulating and inverse-fast-Fourier-transforming the V-ary data; determiner for determining whether the OFDM symbol satisfies a predetermined condition, and if the OFDM symbol satisfies the predetermined condition, classifying the OFDM symbol as a candidate codeword; code extractor for extracting as many codewords as a number of receivable binary data from candidate codewords, in sequence of codewords having a small bit change; and codebook storage unit for forming a codebook by matching the extracted codewords to each receivable binary data. 